An exact algorithm for the concave transportation problem
نویسندگان
چکیده
منابع مشابه
An Exact Algorithm for the Concave Transportation Problem
AbstractAn exact method for solving a class of concave transportation problems which reflect economies of scale is presented. By exploiting concepts of dynamic programming and an analysis of the nature of the recursion, an analytic representation of the optimal allocation at each stage has been developed. This completely avoids the impossible storage requirements of higher dimensional dynamic p...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAn Exact Algorithm for the Mode Identity Project Scheduling Problem
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملAN ELECTROMAGNETISM-LIKE ALGORITHM FOR FIXED CHARGE SOLID TRANSPORTATION PROBLEM
Fixed charge solid transportation problem (FCSTP) is one of the main and most important problems in transportation and network research areas. To tackle such an NP-hard problem, An Electromagnetism-like algorithm (EM) is employed. To the best of our knowledge, EM has been considered for any kind of transportation problems. Due to the significant role of parameters on the algorithm’s performance...
متن کاملan exact algorithm for the mode identity project scheduling problem
in this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (mrcpsp) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. we present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1976
ISSN: 0898-1221
DOI: 10.1016/0898-1221(76)90005-5